Planar and Poly-arc Lombardi Drawings
نویسندگان
چکیده
In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs, noting that every graph has a smooth 2-Lombardi drawing. We show that every planar graph has a smooth planar 3-Lombardi drawing and further investigate topics connecting planarity and Lombardi drawings.
منابع مشابه
Planar Lombardi Drawings of Outerpaths
A Lombardi drawing of a graph is a drawing where edges are represented by circular arcs that meet at each vertex v with perfect angular resolution 360◦/deg(v) [3]. It is known that Lombardi drawings do not always exist, and in particular, that planar Lombardi drawings of planar graphs do not always exist [1], even when the embedding is not fixed. Existence of planar Lombardi drawings is known f...
متن کاملLombardi Drawings of Graphs
We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded...
متن کاملLombardi Drawings of Knots and Links
Knot and link diagrams are projections of one or more 3dimensional simple closed curves into lR, such that no more than two 10 points project to the same point in lR. These diagrams are drawings of 4-regular plane multigraphs. Knots are typically smooth curves in lR, so their projections should be smooth curves in lR with good continuity and large crossing angles: exactly the properties of Lomb...
متن کاملPlanar Lombardi Drawings for Subcubic Graphs
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe–Thurston–Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyp...
متن کاملOn the Usability of Lombardi Graph Drawings
A recent line of work in graph drawing studies Lombardi drawings, i.e., drawings with circular-arc edges and perfect angular resolution at vertices. Little has been known about the effects of curved edges versus straight edges in typical graph reading tasks. In this paper we present the first user evaluation that empirically measures the readability of three different layout algorithms (traditi...
متن کامل